Zitzler and Thiele : Multiobjective Evolutionary Algorithms | Comparison and Strength Pareto Approach
نویسندگان
چکیده
| Evolutionary algorithms (EAs) are often well-suited for optimization problems involving several, often connicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a single run. However, the few comparative studies of diierent methods presented up to now remain mostly qualitative and are often restricted to a few approaches. In this paper, four multiobjective EAs are compared quantitatively where an extended 0/1 knapsack problem is taken as a basis. Furthermore, we introduce a new evolutionary approach to multicriteria optimization, the Strength Pareto EA (SPEA), that combines several features of previous multiobjective EAs in a unique manner. It is characterized by (a) storing nondominated solutions externally in a second, continuously updated population, (b) evaluating an individual's tness dependent on the number of external nondominated points that dominate it, (c) preserving population diversity using the Pareto dominance relationship, and (d) incorporating a clustering procedure in order to reduce the nondominated set without destroying its characteristics. The proof-of-principle results obtained on two artiicial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system , suggest that SPEA can be very eeective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the trade-oo surface. Moreover , SPEA clearly outperforms the other four multiobjec-tive EAs on the 0/1 knapsack problem.
منابع مشابه
SPEA2: Improving the Strength Pareto Evolutionary Algorithm
The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies (Zitzler and Thiele 1999; Zitzler, Deb, and Thiele 2000) SPEA has shown very good performance in comparison to other multiobjective evolutionary algorithms, and therefore it...
متن کاملM-PAES: A Memetic Algorithm for Multiobjective Optimization
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and combines it with the use of a population and recombination. Verification of the new algorithm is carried out by testing it on a set of multiobjective 0/1 knapsack problems. On each problem instance, c...
متن کاملMultiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a single run. However, the few comparative studies of different methods presented up to now remain mostly...
متن کاملComparison of Multiobjective Evolutionary Algorithms on Test Functions of Di erent Di culty
Evolutionary algorithms EAs have become es tablished as the method at hand to explore the Pareto optimal front in multiobjective optimiza tion problems This is not only because there are hardly any alternatives in the eld of multiob jective optimization due to their inherent paral lelism and their capability to exploit similarities of solutions by crossover they are able to capture several Pare...
متن کاملAn Evolutionary Algorithm for Multiobjective Optimization The Strength Pareto Approach
Evolutionary algorithms EA have proved to be well suited for optimization prob lems with multiple objectives Due to their inherent parallelism they are able to capture a number of solutions concurrently in a single run In this report we propose a new evolutionary approach to multicriteria optimization the Strength Pareto Evolutionary Algorithm SPEA It combines various features of previous multi...
متن کامل